Stochastic analysis of a controlled queue with heterogeneous servers and constant retrial rate
نویسندگان
چکیده
In this paper we analyze a controlled retrial queue with several exponential heterogeneous servers in which the time between two successive repeated attempts is independent of the number of customers applying for the service. The customers upon arrival are queued in the orbit or enters service area according to the control policy. This system is analyzed as controlled quasi-birth-and-death (QBD) process. It is showed that the optimal control policy is of threshold and monotone type. We give the explicit formula for the approximation to the optimal threshold levels and propose value iteration algorithm for the exact calculation of the levels. The steady-state analysis is performed using matrix-geometric approach. The main performance characteristics are calculated for the system under optimal threshold policy (OTP) and compared with the same characteristics for the model under scheduling threshold policy (STP) and other heuristic policies, e.g. the usage of the Fastest Free Server (FFS) or Random Server Selection (RSS).
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملA stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule
In this work, we derive insensitive bounds for various performance measures of a single-server retrial queue with generally distributed inter-retrial times and Bernoulli schedule, under the special assumption that only the customer at the head of the orbit queue (i.e., a FCFS discipline governing the flow from the orbit to the server) is allowed to occupy the server. The method...
متن کاملAnalyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کاملStability Analysis of GI/G/c/K Retrial Queue with Constant Retrial Rate
We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has c identical servers and can accommodate the maximal number of K jobs. If a newly arriving job finds the full primary queue, it joins the orbit. The original primary jobs arrive to the system according to a renewal process. The jobs have...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کامل